Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees

نویسنده

  • Guo-Niu Han
چکیده

— We discover another one-parameter generalization of Postnikov's hook length formula for binary trees. The particularity of our formula is that the hook length h v appears as an exponent. As an application, we derive another simple hook length formula for binary trees when the underlying parameter takes the value 1/2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Postnikov's hook length formula for binary trees

We present a combinatorial proof of Postnikov’s hook length formula for binary trees. AMS Classification: 05A15, 05A19

متن کامل

Hook Length Polynomials for Plane Forests of a Certain Type

Abstract. The original motivation for study for hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux. In this paper, we define the hook length polynomial for plane forests of a given degree sequence type and show it can be factored into a product of ...

متن کامل

On Han's Hook Length Formulas for Trees

Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han’s formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang’s extension. We give combinatorial proofs of Yang’s formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees ass...

متن کامل

Generalizations of Han’s Hook Length Identities

Han recently discovered new hook length identities for binary trees. In this paper, we extend Han’s identities to binomial families of trees. Moreover, we present a bijective proof of one of the identities for the family of ordered trees.

متن کامل

Bijective proofs of the hook formula for rooted trees

We present a bijective proof of the hook length formula for rooted trees based on the ideas of the bijective proof of the hook length formula for standard tableaux by Novelli, Pak and Stoyanovskii [10]. In section 4 we present another bijection for the formula. MR Subject Classification: 05A05,05A15

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2009